V-Optimal Filters for Data Approximation in Continuous Data Streams
نویسندگان
چکیده
Monitoring data streams in real time over distributed streaming environments plays a large role in maintaining situation awareness, which is a great challenge due to huge data volumes and bandwidth limitations. In this monitoring process, transmission cost and value accuracy are two very important but conflicting factors in measuring the efficacy of the system. On one hand, increasing value accuracy increases transmission cost. On the other hand, reducing transmission cost, which can be accomplished by smoothing the data, will reduce value accuracy. In this paper, we use V-Optimal histograms to approximate the data distribution at the data sources. The V-Optimal algorithm is used for computing optimal number of buckets and bucket boundaries given a certain error bound, which are then used to approximate and communicate data between the source and the server. We introduce the notion of a soft precision constraint (PC) and use two additional metrics namely, weighted average error and PC violation rate or error rate to control the quality of approximation. We show through extensive experimentation that our approach performs very well in maintaining data quality as well as reducing communication cost.
منابع مشابه
Prediction of Missing Events in Sensor Data Streams Using Kalman Filters
Sensors and instruments are an important source of real time data. However, sensor networks and instruments and their delivery systems can fail due to intrusion attacks, node failures, link failures, or problems in the measuring instruments. Missing data can cause prediction inaccuracies or problems in the continuous events processing process. Estimation techniques can approximate missing data ...
متن کاملOnline Piece-wise Linear Approximation of Numerical Streams with Precision Guarantees
Continuous “always-on” monitoring is beneficial for a number of applications, but potentially imposes a high load in terms of communication, storage and power consumption when a large number of variables need to be monitored. We introduce two new filtering techniques, swing filters and slide filters, that represent within a prescribed precision a time-varying numerical signal by a piecewise lin...
متن کاملAn Approximate Duplicate-Elimination in RFID Data Streams Based on d-Left Time Bloom Filter
Article history: Received 6 March 2010 Received in revised form 16 July 2011 Accepted 18 July 2011 Available online 31 July 2011 The RFID technology has been applied to a wide range of areas since it does not require contact in detecting RFID tags. However, due to the multiple readings in many cases in detecting an RFID tag and the deployment of multiple readers, RFID data contains many duplica...
متن کاملar X iv : c s / 06 09 03 2 v 1 [ cs . D S ] 7 S ep 2 00 6 CR - precis : A deterministic summary structure for update data streams
We present the CR-precis structure, that is a general-purpose, deterministic and sub-linear data structure for summarizing update data streams. The CR-precis structure yields the first deterministic sub-linear space/time algorithms for update streams for answering a variety of fundamental stream queries, such as, (a) point queries, (b) range queries, (c) finding approximate frequent items, (d) ...
متن کاملA graph search algorithm: Optimal placement of passive harmonic filters in a power system
The harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. This paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. The objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic disto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012